Generation of Arbitrarily-Oriented Ribbed-Pattern Images Using Autocorrelation Coefficient
نویسندگان
چکیده
منابع مشابه
Computer Generation of Ribbed Sculptures
Charles Perry’s monumental sculpture Solstice is analyzed and its generative geometrical logic based on a twisted toroidal sweep is captured in a computer program with interactively adjustable control parameters. This program is then used to generate other models of ribbed sculptures based on one or more interlinked torus knots. From this family of sculptures related to Perry’s Solstice we deri...
متن کاملSynthesis of Arbitrarily Oriented Face Views from Two Images
In this paper, we propose a method for synthesizing arbitrarily oriented facial views from only two facial images. The method includes the following features: unlike the 2-D interpolation method, the views by true 3-D rotation can be generated; unlike the stereo, the camera parameters of the two input images are not necessary; although it is based on the structure-frommotion theory, the 3-D str...
متن کاملExtrapolated impulse response filter using coefficient-autocorrelation-matrix decomposition
The smooth predictable envelope and quasi-periodicity of impulse response allows for potential ways to design ultralow-complexity FIR filters. By introducing an extrapolated impulse response technique, a first attempt successfully reduced the arithmetic complexity of FIR filter from oðNÞ to oð ffiffiffiffiffiffiffi 2N p Þ comparing with direct form. However, this conventional way may suffer fro...
متن کاملArbitrarily-Oriented Text Recognition
Recognizing text from natural images is still a hot research topic in computer vision due to its various applications. Despite the enduring research of several decades on optical character recognition (OCR), recognizing texts from natural images is still a challenging task. This is because scene texts are often in irregular arrangements (curved, arbitrarily-oriented or seriously distorted), whi...
متن کاملAutocorrelation Coefficient for the Graph Bipartitioning Problem
Local search and its variants simulated annealing and tabu search are widely used heuristics to approximately solve NP-hard optimization problems. To use local search one \simply" has to specify a neighborhood structure and a cost function which has to be optimized. However, from a theoretical point of view, many questions remain unanswered, and one of the most important is: which neighborhood ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Institute of Industrial Applications Engineers
سال: 2019
ISSN: 2188-1758,2187-8811
DOI: 10.12792/jiiae.7.79